Completing a (k − 1)-Assignment
نویسندگان
چکیده
منابع مشابه
Completing a (k - 1)-Assignment
Let M be an m× n matrix. A k-assignment is a set of k matrix entries of which no two are in the same row or the same column. The value of a k-assignment is the sum of its entries. A k-assignment is optimal if its value is no larger than the value of any other k-assignment. If the entries of the matrix M are random variables then so is the value of the optimal k-assignment, here denoted by mink(...
متن کاملThe k-assignment polytope
In this paper we study the structure of the k-assignment polytope, whose vertices are the m× n (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. This is a natural generalisation of the Birkhoff polytope and many of the known properties of the Birkhoff polytope are generalised. A representation of the faces by certain bipartite graphs is given. This tool is used to...
متن کاملar X iv : m at h / 04 10 34 7 v 1 [ m at h . C O ] 1 5 O ct 2 00 4 COMPLETING A k − 1 ASSIGNMENT
We consider the distribution of the value of the optimal k-assignment in an m× n-matrix, where the entries are independent exponential random variables with arbitrary rates. We give closed formulas for both the Laplace transform of this random variable and for its expected value under the condition that there is a zero-cost k − 1-assignment.
متن کاملCompleting a Metric Space
Recall that a metric space M is said to be complete if every Cauchy sequence in M converges to a limit in M . Not all metric spaces are complete, but it is a fact that all metric spaces can be “completed”, in a way that preserves the essential structure of the metric space. If the space in question is a normed linear space this process completes the space to a Banach space, and an inner product...
متن کاملCompleting h
Nearly a decade ago, the science community was introduced to the h-index, a proposed statistical measure of the collective impact of the publications of any individual researcher. Of course, any method of reducing a complex data set to a single number will necessarily have certain limitations and introduce certain biases. However, in this paper we point out that the definition of the hindex act...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2007
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548306008157